On shredders and vertex connectivity augmentation
نویسندگان
چکیده
منابع مشابه
On shredders and vertex connectivity augmentation
We consider the following problem: given a k-(node) connected graph G find a smallest set F of new edges so that the graph G + F is (k + 1)-connected. The complexity status of this problem is an open question. The problem admits a 2approximation algorithm. Another algorithm due to Jordán computes an augmenting edge set with at most d(k− 1)/2e edges over the optimum. C ⊂ V (G) is a k-separator (...
متن کاملUndirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation
In this paper we study properties for the structure of an undirected graph that is not vertex connected We also study the evolution of this structure when an edge is added to optimally increase the vertex connectivity of the underlying graph Several properties reported here can be extended to the case of a graph that is not k vertex connected for an arbitrary k Using properties obtained here we...
متن کاملFast Algorithms for k-Shredders and k-Node Connectivity Augmentation
A k separator k shredder of an undirected graph is a set of k nodes whose removal results in two or more three or more connected components Let the given undirected graph be k node connected and let n denote the number of nodes Solving an open question we show that the problem of counting the number of k separators is P complete However we present an O k n k n time deterministic algorithm for n...
متن کاملIndependence Free Graphs and Vertex Connectivity Augmentation
Given an undirected graph G and a positive integer k, the k-vertex-connectivity augmentation problem is to find a smallest set F of new edges for which G + F is k-vertex-connected. Polynomial algorithms for this problem have been found only for k≤ 4 and a major open question in graph connectivity is whether this problem is solvable in polynomial time in general. In this paper we develop an algo...
متن کاملTight Bounds on Vertex Connectivity Under Vertex Sampling
A fundamental result by Karger [10] states that for any λ-edgeconnected graph with n nodes, independently sampling each edge with probability p = Ω(logn/λ) results in a graph that has edge connectivity Ω(λp), with high probability. This paper proves the analogous result for vertex connectivity, when sampling vertices. We show that for any k-vertex-connected graph G with n nodes, if each node is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.03.005